Synthesizing switching logic using constraint solving
نویسندگان
چکیده
منابع مشابه
Solving Distributed Constraint Optimization Problems Using Logic Programming
This paper explores the use of answer set programming (ASP) in solving distributed constraint optimization problems (DCOPs). It makes the following contributions: (i) It shows how one can formulate DCOPs as logic programs; (ii) It introduces ASP-DPOP, the first DCOP algorithm that is based on logic programming; (iii) It experimentally shows that ASP-DPOP can be up to two orders of magnitude fas...
متن کاملSynthesizing Switching Logic to Minimize Long-Run Cost
Given a multi-modal dynamical system, optimal switching logic synthesis involves generating the conditions for switching between the system modes such that the resulting hybrid system satisfies a quantitative specification. We formalize and solve the problem of optimal switching logic synthesis for quantitative specifications over long run behavior. Our paper generalizes earlier work on synthes...
متن کاملConstraint Solving in Logic Programming and
Constraint solving has been successfully employed in diverse areas such as Operation Research, Planning, Logic Programming, and Automated Deduction. This has led to the development of a number of specialised approaches as well as to the adoption of diierent integration schemes and methodologies. In this paper we introduce an approach to incorporate constraint solving in term rewriting and we co...
متن کاملLinear Equation Solving for Constraint Logic Programming
Linear constraint solving in constraint logic programming requires in cremental checks of the satis ability of a system of equations and inequali ties Experience has shown that Gauss Jordan elimination and the simplex method are e cient enough to be of practical value in the implementation of CLP languages based on linear arithmetic constraints However these algorithms must be modi ed to accomm...
متن کاملConstraint Satisfaction Using Constraint Logic Programming
Van Hentenryck, P., H. Simonis and M. Dincbas, Constraint satisfaction using constraint logic programming, Artificial Intelligence 58 (1992) 113-159. Constraint logic programming (CLP) is a new class of declarative programming languages whose primitive operations are based on constraints (e.g. constraint solving and constraint entailment). CLP languages naturally combine constraint propagation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2010
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-010-0172-8